Thomas Shermer: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

A linear algorithm for bisecting a polygon

Thomas C. Shermer

Journal:

Information Processing Letters

Year:

1992

Language:

english

File:

PDF, 465 KB

english, 1992

2

On recognizing unions of two convex polygons and related problems

Journal:

Pattern Recognition Letters

Year:

1993

Language:

english

File:

PDF, 865 KB

english, 1993

3

Guarding polyhedral terrains

Prosenjit Bose, Thomas Shermer, Godfried Toussaint, Binhai Zhu

Journal:

Computational Geometry

Year:

1997

Language:

english

File:

PDF, 752 KB

english, 1997

4

[ACM Press the twelfth annual symposium - Philadelphia, Pennsylvania, United States (1996.05.24-1996.05.26)] Proceedings of the twelfth annual symposium on Computational geometry - SCG '96 - On the sectional area of convex polytopes

Avis, David, Bose, Prosenjit, Toussaint, Godfried, Shermer, Thomas C., Zhu, Binhai, Snoeyink, Jack

Year:

1996

Language:

english

File:

PDF, 214 KB

english, 1996

5

Nonadaptive broadcasting in trees

Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer

Journal:

Year:

2011

Language:

english

File:

PDF, 210 KB

english, 2011

6

Grid spanners

Arthur L. Liestman, Thomas C. Shermer

Journal:

Year:

1993

Language:

english

File:

PDF, 837 KB

english, 1993

7

Additive graph spanners

Arthur L. Liestman, Thomas C. Shermer

Journal:

Year:

1993

Language:

english

File:

PDF, 1.51 MB

english, 1993

8

Degree-constrained spanners for multidimensional grids

Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte

Journal:

Discrete Applied Mathematics

Year:

1996

Language:

english

File:

PDF, 1.58 MB

english, 1996

9

Computing bushy and thin triangulations

Journal:

Computational Geometry

Year:

1991

Language:

english

File:

PDF, 739 KB

english, 1991

10

Probing polygons minimally is hard

Patrice Belleville, Thomas C. Shermer

Journal:

Computational Geometry

Year:

1993

Language:

english

File:

PDF, 693 KB

english, 1993

11

Generalized guarding and partitioning for rectilinear polygons

Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas Shermer

Journal:

Computational Geometry

Year:

1996

Language:

english

File:

PDF, 1.41 MB

english, 1996

12

A linear time algorithm to remove winding of a simple polygon

Binay Kumar Bhattacharya, Subir Kumar Ghosh, Thomas Caton Shermer

Journal:

Computational Geometry

Year:

2006

Language:

english

File:

PDF, 939 KB

english, 2006

13

Edge-disjoint spanners in Cartesian products of graphs

Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Journal:

Discrete Mathematics

Year:

2005

Language:

english

File:

PDF, 271 KB

english, 2005

14

Edge-disjoint spanners in tori

Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Journal:

Discrete Mathematics

Year:

2009

Language:

english

File:

PDF, 1.18 MB

english, 2009

15

Computing the maximum clique in the visibility graph of a simple polygon

Subir Kumar Ghosh, Thomas Caton Shermer, Binay Kumar Bhattacharya, Partha Pratim Goswami

Journal:

Journal of Discrete Algorithms

Year:

2007

Language:

english

File:

PDF, 467 KB

english, 2007

16

Factor d-domatic colorings of graphs

Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho

Journal:

Discrete Mathematics

Year:

2003

Language:

english

File:

PDF, 114 KB

english, 2003

17

Edge-disjoint spanners of complete graphs and complete digraphs

Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau

Journal:

Discrete Mathematics

Year:

1999

Language:

english

File:

PDF, 302 KB

english, 1999

18

A counterexample to the algorithms for determining opaque minimal forests

Journal:

Information Processing Letters

Year:

1991

Language:

english

File:

PDF, 117 KB

english, 1991

19

On representations of some thickness-two graphs

Joan P. Hutchinson, Thomas Shermer, Andrew Vince

Journal:

Computational Geometry

Year:

1999

Language:

english

File:

PDF, 121 KB

english, 1999

20

Covering and guarding polygons usingLk-sets

Journal:

Geometriae Dedicata

Year:

1991

Language:

english

File:

PDF, 1012 KB

english, 1991

21

The Superman problem

Naji Mouawad, Thomas Shermer

Journal:

The Visual Computer

Year:

1994

Language:

english

File:

PDF, 1.92 MB

english, 1994

22

Edge-disjoint spanners of complete bipartite graphs

Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau

Journal:

Discrete Mathematics

Year:

2001

Language:

english

File:

PDF, 141 KB

english, 2001

23

Complete roundness classification procedure

Kurt Mehlhorn, Thomas C. Shermer, Chee K. Yap

Journal:

Computer Standards & Interfaces

Year:

1999

Language:

english

File:

PDF, 36 KB

english, 1999

24

Degree-Constrained Network Spanners with Nonconstant Delay

Liestman, Arthur L., Shermer, Thomas C.

Journal:

SIAM Journal on Discrete Mathematics

Year:

1995

Language:

english

File:

PDF, 3.53 MB

english, 1995

25

Illumination of Orthogonal Polygons with Orthogonal Floodlights

Abello, James, Estivill-Castro, Vladimir, Shermer, Thomas, Urrutia, Jorge

Journal:

International Journal of Computational Geometry & Applications

Year:

1998

Language:

english

File:

PDF, 925 KB

english, 1998

26

ADDITIVE SPANNERS FOR HYPERCUBES

LIESTMAN, ARTHUR L., SHERMER, THOMAS C.

Journal:

Parallel Processing Letters

Year:

1991

Language:

english

File:

PDF, 396 KB

english, 1991

27

[ACM Press the 23rd international conference - Edmonton, AB, Canada (2014.08.24-2014.08.27)] Proceedings of the 23rd international conference on Parallel architectures and compilation - PACT '14 - Bitwise data parallelism in regular expression matching

Cameron, Robert D., Shermer, Thomas C., Shriraman, Arrvindh, Herdy, Kenneth S., Lin, Dan, Hull, Benjamin R., Lin, Meng

Year:

2014

Language:

english

File:

PDF, 594 KB

english, 2014

28

[ACM Press the thirteenth annual symposium - Nice, France (1997.06.04-1997.06.06)] Proceedings of the thirteenth annual symposium on Computational geometry - SCG '97 - A complete roundness classification procedure

Mehlhorn, Kurt, Shermer, Thomas C., Yap, Chee K.

Year:

1997

Language:

english

File:

PDF, 979 KB

english, 1997

29

POINT VISIBILITY GRAPHS AND -CONVEX COVER

BREMNER, DAVID, SHERMER, THOMAS

Journal:

International Journal of Computational Geometry & Applications

Year:

2000

Language:

english

File:

PDF, 2.16 MB

english, 2000

30

Computing the k-Visibility Region of a Point in a Polygon

Bahoo, Yeganeh, Bose, Prosenjit, Durocher, Stephane, Shermer, Thomas C.

Journal:

Theory of Computing Systems

Year:

2020

File:

PDF, 906 KB

2020